Solving Sudoku using Boolean Algebra
نویسندگان
چکیده
منابع مشابه
Solving Sudoku with Boolean Algebra
Sudoku is a very popular puzzle which consists of placing several numbers in a squared grid according to some simple rules. In this paper, we present a Sudoku solving technique named Boolean Sudoku Solver (BSS) using only simple Boolean algebras. Use of Boolean algebra increases the execution speed of the Sudoku solver. Simulation results show that our method returns the solution of the Sudoku ...
متن کاملSolving Sudoku Using Combined Message Passing Algorithms
In this paper we apply message-passing algorithms to solve Sudoku puzzles. We provide explicit expression for the sum-product algorithm and the max-product algorithm and analyze the difference between the algorithms in terms of performance and efficiency. The failure of the max-product algorithm when been applied to Sudoku problem is due to the existence of stopping-sets. We show empirically th...
متن کاملSolving Sudoku Using Probabilistic Graphical Models
Sudoku is a popular number puzzle. Here, we model the puzzle as a probabilistic graphical model and drive a modification to the well-known sum-product and max-product message passing to solve the puzzle. In addition, we propose a Sudoku solver utilizing a combination of message passing and Sinkhorn balancing and show that as Sudoku puzzles become larger, the impact of loopy propagation does not...
متن کاملSolving Single-Digit Sudoku Subproblems
We show that single-digit “Nishio” subproblems in n×n Sudoku puzzles may be solved in time o(2n), faster than previous solutions such as the pattern overlay method. We also show that single-digit deduction in Sudoku is NP-hard.
متن کاملTechniques for Solving Sudoku Puzzles
Solving Sudoku puzzles is one of the most popular pastimes in the world. Puzzles range in difficulty from easy to very challenging; the hardest puzzles tend to have the most empty cells. The current paper explains and compares three algorithms for solving Sudoku puzzles. Backtracking, simulated annealing, and alternating projections are generic methods for attacking combinatorial optimization p...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Computer Applications
سال: 2012
ISSN: 0975-8887
DOI: 10.5120/8331-9024